A bound for the first k-1 consecutive k-th power non-residues (mod p)
نویسندگان
چکیده
منابع مشابه
The least k-th power non-residue
Let p be a prime number and let k ≥ 2 be an integer such that k divides p − 1. Norton proved that the least k-th power non-residue modp is at most 3.9p log p unless k = 2 and p ≡ 3 (mod 4), in which case the bound is 4.7p log p. With a combinatorial idea and a little help from computing power, we improve the upper bounds to 0.9p log p and 1.1p log p, respectively.
متن کاملON QUADRUPLES OF CONSECUTIVE ¿th POWER RESIDUES
In [2] it was shown that A(&, 4) = co for fe^ 1048909 and it was conjectured that A(&, 4) = =° for all k. In this paper we establish this conjecture with the following Theorem. A(&, 4) = ». Proof. It suffices to prove the theorem for values of k which are prime. The proof makes use of the following proposition which is a special case of a result of Kummer [l] (see also [3]). Proposition. Let k ...
متن کاملMore Efficient Cryptosystems From k-th Power Residues
At Eurocrypt 2013, Joye and Libert proposed a method for constructing public key cryptosystems (PKCs) and lossy trapdoor functions (LTDFs) from (2)-power residue symbols. Their work can be viewed as non-trivial extensions of the well-known PKC scheme due to Goldwasser and Micali, and the LTDF scheme due to Freeman et al., respectively. In this paper, we will demonstrate that this kind of work c...
متن کاملON THE PARITY OF k-TH POWERS MOD P A GENERALIZATION OF A PROBLEM OF LEHMER
Let p be an odd prime, k, A ∈ Z, p A, d = (p − 1, k), d1 = (p − 1, k − 1), s = (p − 1)/d, t = (p − 1)/d1, E the set of even residues in Zp = Z/(p), O the set of odd residues, and Nk = #{x ∈ E : Axk ∈ O}. We give several estimates of Nk, each of different strength depending on the size and parity of s, t and k. In particular we show that Nk ∼ p4 provided that k is even and the set of all k-th po...
متن کاملOn primitive roots of 1 mod p k, divisors of p ± 1, Wieferich primes, and quadratic analysis mod p 3
On primitive roots of 1 mod p k , divisors of p ± 1, Wieferich primes, and quadratic analysis mod p Abstract Primitive roots of 1 mod p k (k > 2 and odd prime p) are sought, in cyclic units group G k ≡ A k B k mod p k , coprime to p, of order (p − 1)p k−1. 'Core' subgroup A k has order p − 1 independent of precision k, and 'extension' subgroup B k of all p k−1 residues 1 mod p is generated by p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Acta Arithmetica
سال: 1975
ISSN: 0065-1036,1730-6264
DOI: 10.4064/aa-28-3-341-343